A Note on Globally Admissible Inference Rules for Modal and Superintuitionistic Logics
نویسنده
چکیده
In this shot note we consider globally admissible inference rules. A rule r is globally admissible in a logic L if r is admissible in all logics with the finite model property which extend L. Here we prove a reduction theorem: we show that, for any modal logic L extending K4, a rule r is globally admissible in L iff r is admissible in all tabular logics extending L. The similar result holds for superintuitionistic logics.
منابع مشابه
Complexity of admissible rules
We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionistic logics. We state a broad condition under which the admissibility problem is coNEXP -hard. We also show that admissibility in several well-known systems (including GL, S4, and IPC ) is in coNE , thus obtaining a sharp complexity estimate for admissibility in...
متن کاملRules with parameters in modal logic I
We study admissibility of inference rules and unification with parameters in transitive modal logics (extensions of K4), in particular we generalize various results on parameterfree admissibility and unification to the setting with parameters. Specifically, we give a characterization of projective formulas generalizing Ghilardi’s characterization in the parameter-free case, leading to new proof...
متن کاملCanonical rules
We develop canonical rules capable of axiomatizing all systems of multiple-conclusion rules over K4 or IPC , by extension of the method of canonical formulas by Zakharyaschev [37]. We use the framework to give an alternative proof of the known analysis of admissible rules in basic transitive logics, which additionally yields the following dichotomy: any canonical rule is either admissible in th...
متن کاملDescription of Modal Logics Inheriting Admissible Rules for K4
We give a necessary and sufficient condition for any modal logic with fmp to inherit all inference rules admissible in S4. Using this condition we describe all tabular modal logics inheriting inference rules admissible for S4.
متن کاملMulti-modal and Temporal Logics with Universal Formula - Reduction of Admissibility to Validity and Unification
The article studies multi-modal (in particular temporal, tense, logics) possessing universal formulas. We prove (Theorems 11 and 12) that the admissibility problem for inference rules (inference rules with parameters) is decidable for all decidable multi-modal (in particular, temporal) logics possessing an universal formula and decidable w.r.t. unification (unification with parameters). These t...
متن کامل